A Trust Region Algorithm Model With Radius Bounded Below for Minimization of Locally Lipschitzian Functions∗
نویسندگان
چکیده
The classical trust region algorithm was extended to the nonsmooth minimization problem successful by Qi and Sun. Combining the trust region algorithm of Qi and Sun and the trust region algorithm with radius bounded below of Jiang for solving generalized complementarity problems, this paper present a new trust region algorithm with radius bounded below for the unconstrained nonsmooth optimization problems where the objective function is locally Lipschitzian, the global convergence results are established.
منابع مشابه
Minimization of the Sheet Thinning in Hydraulic Deep Drawing Process Using Response Surface Methodology and Finite Element Method
In most of the sheet forming processes, production of the parts with minimum thickness variation and low required force is important. In this research, minimization of the sheet thinning and forming force in the hydraulic deep drawing process has been studied. Firstly, the process is simulated using the finite element method (FEM) and simulation model is verified using the experimental results....
متن کاملAn Unconstrained Optimization Technique for Nonsmooth Nonlinear Complementarity Problems
In this article, we consider an unconstrained minimization formulation of the nonlinear complementarity problem NCP(f) when the underlying functions are H-differentiable but not necessarily locally Lipschitzian or directionally differentiable. We show how, under appropriate regularity conditions on an H-differential of f , minimizing the merit function corresponding to f leads to a solution of ...
متن کاملA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...
متن کاملNewton's Method with a Model Trust Region Modification
A modified Newton method for unconstrained minimization is presented and analyzed. The modification is based upon the model trust region approach. This report contains a thorough analysis of the locally constrained quadratic minimizations that arise as subproblems in the modified Newton iteration. Several promising alternatives are presented for solving these subproblems in ways that overcome c...
متن کاملOn the convergence of trust region algorithms for unconstrained minimization without derivatives
We consider iterative trust region algorithms for the unconstrained minimization of an objective function F (x), x∈R, when F is differentiable but no derivatives are available, and when each model of F is a linear or a quadratic polynomial. The models interpolate F at n+1 points, which defines them uniquely when they are linear polynomials. In the quadratic case, second derivatives of the model...
متن کامل